Intersection Properties of Families Containing Sets of Nearly the Same Size

نویسندگان

  • P. Erdős
  • R. Silverman
  • A. Stein
چکیده

A family F of sets has property B(s) if there exists a set S whose intersection with each set in F is non-empty but contains fewer than s elements . P . Erdős has asked whether there exists an absolute constant c such that every projective plane has property B(c) . In this paper, the authors, as a partial answer to this question, obtain the result that for n sufficiently large, every projective plane of order n has property B(c log n) . The result is a corollary of a theorem applicable to somewhat more general families of finite sets .

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

MECHANICAL PROPERTIES OF DENTAL COMPOSITE MATERIALS REINFORCED WITH MICRO AND NANO-SIZE Al2O3 FILLER PARTICLES

Abstract: Composite specimens were prepared by dispersion of various amounts of nano-sized Al2O3 fillers in a monomer system containing 60% Bis-GMA and 40% TEGDMA. For comparative purposes, composite samples containing micrometer size Al2O3 fillers were also prepared following the same procedure. The mechanical properties of the light- cured samples were assessed by three-point flexural strengt...

متن کامل

dominating subset and representation graph on topological spaces

Let a topological space. An intersection graph on a topological space , which denoted by ‎ , is an undirected graph which whose vertices are open subsets of and two vertices are adjacent if the intersection of them are nonempty. In this paper, the relation between topological properties of  and graph properties of ‎  are investigated. Also some classifications and representations for the graph ...

متن کامل

Extremal problems on ∆-systems

A family of sets is called a ∆-system (respectively, a weak ∆-system) if the intersection of any two sets is the same (respectively, the cardinality of the intersection of any two sets is the same). In 1960, P.Erdős and R.Rado started studying the maximum size of a k-uniform hypergraph not containing a ∆-system of a given size. The aim of the present article is to survey the progress and state ...

متن کامل

Combinatorial Properties for Families of H-convex Sets

Intersection results for families of H-convex sets in H-spaces are given. These extend known results concerning families of convex sets in topological vector spaces, such as the Berge-Klee intersection theorem and a previous result of the author. MSC 2000. 52A01, 14E20.

متن کامل

Sweep Line Algorithm for Convex Hull Revisited

Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004